Ticket Entailment plus the mingle axiom has the variable-sharing property

نویسندگان

  • José M. Méndez
  • Gemma Robles
  • Francisco Salto
چکیده

The logic TM is the result of adding the mingle axiom to Ticket Entailment logic, T. In the present paper, it is proved that TM has the variable-sharing property (vsp). Ternary relational semantics for TM is provided. Finally, an interesting extension of TM with the vsp is briefly discussed.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiplicative Conjunction and an Algebraic Meaning of Contraction and Weakening

We show that the elimination rule for the multiplicative (or intensional) conjunction ^ is admissible in many important multiplicative substructural logics. These include LL m (the multiplicative fragment of Linear Logic) and RMI m (the system obtained from LL m by adding the contraction axiom and its converse, the mingle axiom.) An exception is R m (the intensional fragment of the relevance lo...

متن کامل

A constructive negation for logics including TW+

The logic TW+ is positive Ticket Entailment without the contraction axiom. Constructive negation is understood in the (minimal) intuitionistic sense but without paradoxes of relevance. It is shown how to introduce a constructive negation of this kind in positive logics at least as strong as TW+. Special attention is paid to the reductio axioms. Concluding remarks about relevance, modal and enta...

متن کامل

On the compactness property of extensions of first-order G"{o}del logic

We study three kinds of compactness in some variants of G"{o}del logic: compactness,entailment compactness, and approximate entailment compactness.For countable first-order underlying language we use the Henkinconstruction to prove the compactness property of extensions offirst-order g logic enriched by nullary connective or the Baaz'sprojection connective. In the case of uncountable first-orde...

متن کامل

Entailment-based Axiom Pinpointing in Debugging Incoherent Terminologies

One of the major problems of axiom pinpointing for incoherent terminologies is the precise positioning within the conflict axioms. In this paper we present a formal notion for the entailment-based axiom pinpointing of incoherent terminologies, where the parts of an axiom is defined by atomic entailment. Based on these concepts, we prove the one-to-many relationship between existing axiom pinpoi...

متن کامل

Ticket Entailment is decidable

We prove the decidability of the logic T→ of Ticket Entailment. Raised by Anderson and Belnap within the framework of relevance logic, this question is equivalent to the question of the decidability of type inhabitation in simply-typed combinatory logic with the partial basis BBIW. We solve the equivalent problem of type inhabitation for the restriction of simply-typed lambda-calculus to heredi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Logic Journal of the IGPL

دوره 20  شماره 

صفحات  -

تاریخ انتشار 2012